Bounds and complexity results for strong edge colouring of subcubic graphs
نویسندگان
چکیده
منابع مشابه
On strong edge-colouring of subcubic graphs
A strong edge-colouring of a graph G is a proper edge-colouring such that every path of length 3 uses three different colours. In this paper we improve some previous results on the strong edgecolouring of subcubic graphs by showing that every subcubic graph with maximum average degree strictly less than 73 (resp. 5 2 , 8 3 , 20 7 ) can be strongly edge-coloured with six (resp. seven, eight, nin...
متن کاملStrong edge-colouring and induced matchings
A strong edge-colouring of a graph G is a proper edge-colouring such that every path of three edges uses three colours. An induced matching of a graph G is a subset I of edges of G such that the graph induced by the endpoints of I is a matching. In this paper, we prove the NP-completeness of strong 4, 5, and 6-edge-colouring and maximum induced matching in some subclasses of subcubic triangle-f...
متن کاملStrong edge colouring of subcubic graphs
HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau...
متن کاملList-colouring Squares of Sparse Subcubic Graphs
The problem of colouring the square of a graph naturally arises in connection with the distance labelings, which have been studied intensively. We consider this problem for sparse subcubic graphs. We show that the choosability χ (G2) of the square of a subcubic graph G of maximum average degree d is at most four if d < 24/11 and G does not contain a 5-cycle, χ (G2) is at most five if d < 7/3 an...
متن کاملList-Coloring Squares of Sparse Subcubic Graphs
The problem of colouring the square of a graph naturally arises in connection with the distance labelings, which have been studied intensively. We consider this problem for sparse subcubic graphs and show that the choosability χ`(G 2) of the square of a subcubic graph G of maximum average degree d is at most four if d < 24/11 and G does not contain a 5-cycle, χ`(G 2) is at most five if d < 7/3 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electronic Notes in Discrete Mathematics
دوره 38 شماره
صفحات -
تاریخ انتشار 2011